- lambda abstraction
- λ-абстракция
English-Russian electronics dictionary .
lambda abstraction
Смотреть что такое "lambda abstraction" в других словарях:
Abstraction (disambiguation) — Abstraction may refer to one of the following: * Abstraction, the thought process wherein ideas are distanced from objects * Abstraction (computer science), a mechanism and practice to reduce and factor out details so that one can focus on few… … Wikipedia
Lambda calculus — In mathematical logic and computer science, lambda calculus, also written as λ calculus, is a formal system designed to investigate function definition, function application and recursion. It was introduced by Alonzo Church and Stephen Cole… … Wikipedia
Abstraction (computer science) — In computer science, abstraction is the process by which data and programs are defined with a representation similar to its pictorial meaning as rooted in the more complex realm of human life and language with their higher need of summarization… … Wikipedia
Lambda-Calcul — « La notion de λ définissabilité fut la première de ce qui est accepté maintenant comme l équivalent exact des descriptions mathématiques pour lesquelles des algorithmes existent. » Stephen Kleene, in Origins of Recursive Function … Wikipédia en Français
Lambda calcul — « La notion de λ définissabilité fut la première de ce qui est accepté maintenant comme l équivalent exact des descriptions mathématiques pour lesquelles des algorithmes existent. » Stephen Kleene, in Origins of Recursive Function … Wikipédia en Français
Lambda cube — In mathematical logic and type theory, the λ cube is a framework for exploring the axes of refinement in Coquand s calculus of constructions, starting from the simply typed lambda calculus as the vertex of a cube placed at the origin, and the… … Wikipedia
Lambda-calcul — Le lambda calcul (ou λ calcul) est un système formel inventé par Alonzo Church dans les années 1930, qui fonde les concepts de fonction et d application. Il a été le premier formalisme utilisé pour définir et caractériser les fonctions récursives … Wikipédia en Français
Lambda-mu calculus — In mathematical logic and computer science, the lambda mu calculus is an extension of the lambda calculus, and was introduced by M. Parigot in [lambda mu] calculus: an algorithmic interpretation of classical natural deduction , Springer LNAI no.… … Wikipedia
Lambda cube — Initialement proposé par Henk Barendregt[1], le λ cube permet de visualiser les différentes dimensions pour lesquelles le Calcul des constructions apporte une généralisation par rapport au lambda calcul simplement typé où un terme ne peut… … Wikipédia en Français
Simply typed lambda calculus — The simply typed lambda calculus (lambda^ o) is a typed interpretation of the lambda calculus with only one type combinator: o (function type). It is the canonical and simplest example of a typed lambda calculus. The simply typed lambda calculus… … Wikipedia
Typed lambda calculus — A typed lambda calculus is a typed formalism that uses the lambda symbol (lambda) to denote anonymous function abstraction. Typed lambda calculi are foundational programming languages and are the base of typed functional programming languages… … Wikipedia
